Translating a convex polygon to contain maximum number of points

Translating a Convex Polygon to Contain a Maximum Number of Points

An Analytical Solution for Inverse Determination of Residual Stress Field

An analytical solution is presented that reconstructs residual stress field from limited and incomplete data.  The inverse problem of reconstructing residual stresses is solved using an appropriate form of the airy stress function.  This function is chosen to satisfy the stress equilibrium equations together with the boundary conditions for a domain within a convex polygon.  The analytical solu...

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

The union of moving polygonal pseudodiscs - Combinatorial bounds and applications

Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial changes in the union of P is (n (n)). In general, if the pseudodiscs move along curved trajectories, then the maximum number of changes in the union is (n s+2(n)), where s is the maximum number of times any triple of polyg...

Enhanced Way for Computing Smallest Convex Polygon and Euler Number

A convex hull is a polygon which encloses all given set of points.Euler number or Euler characteristic of an image has proven to be an important feature in many image analyses and visual inspection applications. This paper presents an algorithm for fast computing the convex hull of a planar scattered point set, which pre-strike an initial convex hull boundary, remove internal points in the boun...